285 Some Polyethylene Mulches Increase Root Numbers in Peppers

Root numbers

Chromatic Numbers in Some Graphs

Let G = (V,E) be a graph. A k-coloring of a graph G is a labeling f : V (G) → T , where | T |= k and it is proper if the adjacent vertices have different labels. A graph is k-colorable if it has a proper k-coloring. The chromatic number χ(G) is the least k such that G is k-colorable. Here we study chromatic numbers in some kinds of Harary graphs. Mathematics Subject Classification: 05C15

Root Numbers and Ranks in Positive Characteristic

For a global fieldK and an elliptic curve Eη overK(T ), Silverman’s specialization theorem implies rank(Eη(K(T ))) ≤ rank(Et(K)) for all but finitely many t ∈ P(K). If this inequality is strict for all but finitely many t, the elliptic curve Eη is said to have elevated rank. All known examples of elevated rank for K = Q rest on the parity conjecture for elliptic curves over Q, and the examples ...

ON SOME STRUCTURES OF FUZZY NUMBERS

The operations in the set of fuzzy numbers are usually obtained bythe Zadeh extension principle. But these definitions can have some disadvantagesfor the applications both by an algebraic point of view and by practicalaspects. In fact the Zadeh multiplication is not distributive with respect tothe addition, the shape of fuzzy numbers is not preserved by multiplication,the indeterminateness of t...

Some properties of fuzzy real numbers

In the mathematical analysis, there are some theorems and definitions that established for both real and fuzzy numbers. In this study, we try to prove  Bernoulli's inequality in fuzzy real numbers with some of its applications. Also, we prove two other theorems in fuzzy real numbers which are proved before, for real numbers.